Efficient minimization of deterministic weak ω-automata
نویسنده
چکیده
We analyze the minimization problem for deterministic weak automata, a subclass of deterministic Büchi automata, which recognize the regular languages that are recognizable by deterministic Büchi and deterministic co-Büchi automata. We reduce the problem to the minimization of finite automata on finite words and obtain an algorithm running in time O(n · logn), where n is the number of states of the automaton. 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Minimization and Learning in the class DWBA
In this paper, we give a characterization based on Nerode’s right congruence of DWBA which is the subclass of ω-regular languages which are recognized by a deterministic weak Büchi automaton (DWBA). Thanks to that we can define a partial minimization of deterministic Büchi automata (DBA) and explain the DWBA minimization due to Löding [Löd01]. We have also explain in a different manner the Lear...
متن کاملBackward deterministic and weak alternating $\omega$-automata
We present a direct transformation of weak alternating ω-automata into equivalent backward deterministic ω-automata and show (1) how it can be used to obtain a transformation of non-deterministic Büchi automata into equivalent backward deterministic automata and (2) that it yields optimal equivalent backward deterministic automata when applied to linear-time temporal logic formulas. (1) uses th...
متن کاملSAT-based Minimization of Deterministic ω-Automata
We describe a tool that inputs a deterministic ω-automaton with any acceptance condition, and synthesizes an equivalent ω-automaton with another arbitrary acceptance condition and a given number of states, if such an automaton exists. This tool, that relies on a SAT-based encoding of the problem, can be used to provide minimal ω-automata equivalent to given properties, for different acceptance ...
متن کاملRegularity Problems for Weak Pushdown ω-Automata and Games
We show that the regularity and equivalence problems are decidable for deterministic weak pushdown ω-automata, giving a partial answer to a question raised by Cohen and Gold in 1978. We prove the decidability by a reduction to the corresponding problems for deterministic pushdown automata on finite words. Furthermore, we consider the problem of deciding for pushdown games whether a winning stra...
متن کاملMechanizing the Powerset Construction for Restricted Classes of ω-Automata
Automata over infinite words provide a powerful framework, which we can use to solve various decision problems. However, the automatized reasoning with restricted classes of automata over infinite words is often simpler and more efficient. For instance, weak deterministic Büchi automata, which recognize the ω-regular languages in the Borel class Fσ ∩Gδ, can be handled algorithmically almost as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001